The appearance of coverage holes in the network leads to transmission links being disconnected, thereby resulting in decreasing the\naccuracy of data. Timely detection of the coverage holes can effectively improve the quality of network service. Compared with\nother coverage hole detection algorithms, the algorithms based on the Rips complex have advantages of high detection accuracy\nwithout node location information, but with high complexity. This paper proposes an efficient coverage hole detection\nalgorithm based on the simplified Rips complex to solve the problem of high complexity. First, Turanâ??s theorem is combined\nwith the concept of the degree and clustering coefficient in a complex network to classify the nodes; furthermore, redundant\nnode determination rules are designed to sleep redundant nodes. Second, according to the concept of the complete graph,\nredundant edge deletion rules are designed to delete redundant edges. On the basis of the above two steps, the Rips complex is\nsimplified efficiently. Finally, from the perspective of the loop, boundary loop filtering and reduction rules are designed to\nachieve coverage hole detection in wireless sensor networks. Compared with the HBA and tree-based coverage hole detection\nalgorithm, simulation results show that the proposed hole detection algorithm has lower complexity and higher accuracy and\nthe detection accuracy of the hole area is up to 99.03%.
Loading....